A Task-driven Parallel Code Generation Scheme for Coarse Grain Parallelization on Android Platform
نویسندگان
چکیده
منابع مشابه
Coarse Grain Task Parallelization of Earthquake Simulator GMS Using OSCAR Compiler on Various Cc-NUMA Servers
This paper proposes coarse grain task parallelization for a earthquake simulation program using Finite Difference Method to solve the wave equations in 3-D heterogeneous structure or the Ground Motion Simulator (GMS) on various cc-NUMA servers using IBM, Intel and Fujitsu multicore processors. The GMS has been developed by the National Research Institute for Earth Science and Disaster Preventio...
متن کاملCode generation techniques for the task-parallel programming language Spar
In this paper we describe a compilation scheme to translate implicitly parallel programs in the programming language Spar (an extension to Java) to efficient code for distributed-memory parallel computer systems. The compilation scheme is formulated as a set of transformation rules. In Spar, the language constructs for parallelization have been designed for comfortable use by the programmer, no...
متن کاملTime-Shifted Modules: Exploiting Code Modularity for Fine Grain Parallelization
Multi-threaded processors and chip-multiprocessors execute concurrent threads in close physical proximity, potentially reducing the cost of synchronization and communication significantly and enabling the parallelization of programs at a fine grain. In this paper, we explore a source of fine-grain parallelism present in programs due to their modular nature. Concurrency is derived from executing...
متن کاملCronus: A platform for parallel code generation based on computational geometry methods
This paper describes CRONUS, a platform for parallelizing general nested loops. General nested loops contain complex loop bodies (assignments, conditionals, repetitions) and exhibit uniform loop-carried dependencies. The novelty of CRONUS is twofold: (1) it determines the optimal scheduling hyperplane using the QuickHull algorithm, which is more efficient than previously used methods, and (2) i...
متن کاملBuilding and Scheduling Coarse Grain Task Graphs
It has been shown recently that it is possible to eeciently schedule direct acyclic task graphs. A tool like Pyrros 14] is able to generate a parallel program, if the user speciies precedence constraints between the tasks. This approach has two major drawbacks: it is hard for the user to perform a good analysis of the source code and scheduling a DAG is costly in terms of memory and time. In 3]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2017
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.25.426